Avoiding bends

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ESCRT-III gets the bends

Mitotic cells’ shocking response to stress E lsing et al. reveal how some vulnerable mitotic cells protect themselves from stress. One way that cells cope with stress is by making heat-shock proteins such as Hsp70 that shield other proteins from damage. The transcription factor HSF1 serves as the main activator for heat-shock protein genes. During interphase, another transcription factor, HSF2,...

متن کامل

Orthogonal Compaction using Additional Bends

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing...

متن کامل

Sar1 bends membranes into shape

Sar1 bends membranes into shape V esicle formation involves curving membranes into buds that constrict at the neck and eventually pinch off completely. Coat proteins and their regulators induce these membrane deformations. In the case of ER to Golgi transport, vesicle formation is initiated by the small GTPase Sar1 and the COPII coat proteins that it recruits to ER exit sites. Long et al. now d...

متن کامل

The Rectilinear κ - Bends TSP

We study a hard geometric problem. Given n points in the plane and a positive integer k, the Rectilinear k-Bends Traveling Salesman Problem asks if there is a piecewise linear tour through the n points with at most k bends where every line-segment in the path is either horizontal or vertical. The problem has applications in VLSI design. We prove that this problem belongs to the class FPT (fixed...

متن کامل

The Rectilinear k-Bends TSP

We study a hard geometric problem. Given n points in the plane and a positive integer k, the Rectilinear k-Bends Traveling Salesman Problem asks if there is a piecewise linear tour through the n points with at most k bends where every line-segment in the path is either horizontal or vertical. The problem has applications in VLSI design. We prove that this problem belongs to the class FPT (fixed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1994

ISSN: 0028-0836,1476-4687

DOI: 10.1038/368490d0